Job Assignment Problem Using Union Group Graph Labelling
نویسندگان
چکیده
Let SG be the group and a collection of subgroups Then union graph is denoted by U(SG) whose vertex set itself two vertices Li Lj;i? j in are adjacent if only either ? Lj or for i ? j. A G said to on ? some SG. This paper describes simple labelling applied job assignment problem. The task problem related one fundamental combinatorial problems branch optimization. Key words-union graph, groups, bipartite
منابع مشابه
Labelling Topics using Unsupervised Graph-based Methods
This paper introduces an unsupervised graph-based method that selects textual labels for automatically generated topics. Our approach uses the topic keywords to query a search engine and generate a graph from the words contained in the results. PageRank is then used to weigh the words in the graph and score the candidate labels. The state-of-the-art method for this task is supervised (Lau et al...
متن کاملWhen does a biased graph come from a group labelling?
A biased graph consists of a graph G together with a collection of distinguished cycles of G, called balanced, with the property that no theta subgraph contains exactly two balanced cycles. Perhaps the most natural biased graphs on G arise from orienting G and then labelling the edges of G with elements of a group Γ. In this case, we may define a biased graph by declaring a cycle to be balanced...
متن کاملLocomotive assignment problem with train precedence using genetic algorithm
This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations...
متن کاملNeuro-Fuzzy classification for the job assignment problem
We propose to use an adaptive neuro-fuzzy inference system in order to optimize decision making for the job assignment problem of the US Navy. Results need to be considered carefully because of the high noise level naturally present in the data coming from human decisions.
متن کاملGraph embedding using tree edit-union
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a pattern space representation for the set of trees. To do this we construct a super-tree to span the union of the set of trees. This is a chicken and egg problem, since before the structure can be estimated correspondences b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2021
ISSN: ['1757-8981', '1757-899X']
DOI: https://doi.org/10.1088/1757-899x/1070/1/012008